| Conditions | 2 |
| Paths | 4 |
| Total Lines | 22 |
| Lines | 0 |
| Ratio | 0 % |
| Changes | 1 | ||
| Bugs | 0 | Features | 0 |
| 1 | import { |
||
| 5 | function recurseDeleteKey(currentLevel, arrayKeyAttr) { |
||
| 6 | var currentArray = arrayKeyAttr.slice(0) |
||
| 7 | |||
| 8 | if (arrayKeyAttr.length === 1) { |
||
| 9 | delete currentLevel[arrayKeyAttr[0]] |
||
| 10 | } |
||
| 11 | |||
| 12 | Array.prototype.forEach.call(currentArray, (key) => { |
||
| 13 | if(currentLevel[key] != null) { |
||
| 14 | currentLevel = currentLevel[key] |
||
| 15 | currentArray.shift() |
||
| 16 | recurseDeleteKey(currentLevel, currentArray) |
||
| 17 | if(typeof currentLevel === 'object' && Object.prototype.toString.call(currentLevel) === '[object Array]') { |
||
| 18 | Array.prototype.forEach.call(currentLevel, (item) => { |
||
| 19 | recurseDeleteKey(item, currentArray) |
||
| 20 | }) |
||
| 21 | }else { |
||
| 22 | recurseDeleteKey(currentLevel, currentArray) |
||
| 23 | } |
||
| 24 | } |
||
| 25 | }) |
||
| 26 | } |
||
| 27 | |||
| 44 | } |